Drawing Disconnected Graphs on the Klein Bottle
نویسندگان
چکیده
Résumé We prove that two disjoint graphs must always be drawn separately on the Klein bottle in order to minimize the crossing number of the whole drawing.
منابع مشابه
Chromatic numbers of 6-regular graphs on the Klein bottle
In this paper, we determine chromatic numbers of all 6-regular loopless graphs on the Klein bottle. As a consequence, it follows that every simple 6-regular graph on the Klein bottle is 5-colorable.
متن کاملIrreducible Quadrangulations of the Klein Bottle
In this paper, we shall determine the complete list of irreducible quadrangulations of the Klein bottle. By this result, we can easily list all the minorminimal 2-representative graphs on the Klein bottle. Moreover, we shall show that any two bipartite quadrangulations of the Klein bottle with at least 10 vertices are transformed into each other by a sequence of diagonal slides and a sequence o...
متن کاملFour-regular graphs that quadrangulate both the torus and the Klein bottle
In this paper, we characterize 4-regular graphs which can quadrangulate both the torus and the Klein bottle.
متن کاملColoring Eulerian Triangulations of the Klein Bottle
We show that an Eulerian triangulation of the Klein bottle has chromatic number equal to six if and only if it contains a complete graph of order six, and it is 5-colorable, otherwise. As a consequence of our proof, we derive that every Eulerian triangulation of the Klein bottle with facewidth at least four is 5-colorable.
متن کاملSmall snarks and 6-chromatic triangulations on the Klein bottle
It is known that for every nonorientable surface there are infinitely many (large) snarks that can be polyhedrally embedded on that surface. We take a dual approach to the embedding of snarks on the Klein bottle, and investigate edge-colorings of 6-chromatic triangulations of the Klein bottle. In the process, we discover the smallest snarks that can be polyhedrally embedded on the Klein bottle....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 26 شماره
صفحات -
تاریخ انتشار 2010